Classifying the Duat
نویسندگان
چکیده
منابع مشابه
Classifying the Hungarian Web
In this paper we present some lessons learned from building vizsla, the keyword search and topic classification system used on the largest Hungarian portal, [origo.hu]. Based on a simple statistical language model, and the largescale supporting evidence from vizsla, we argue that in topic classification only positive ev-
متن کاملClassifying the Unclassifiables
George Mackey devoted his career to exploring the basic unity of mathematics, and to understanding its relationships to modern physics. He was a major figure in the flowering of group representation theory and related portions of functional analysis that occured in the middle decades of the last century. Sadly, he, along with many of his colleagues who participated in this endeavor, is no longe...
متن کاملANFIS system: An algorithm for diagnosing and classifying the levels of depression in the elderly
Introduction: The diagnosis and classification of depression as the most common abnormal psychological disorder in the elderly has received less attention. The aim of the study was to use the ANFIS system to automatically process information in order to provide an appropriate algorithm for predicting the depression of the elderly. Method: The applied study was performed at the Gonbad Kavous Eld...
متن کاملClassifying the Epilepsy Based on the Phase Space Sorted With the Radial Poincaré Sections in Electroencephalography
Background: Epilepsy is a brain disorder that changes the basin geometry of the oscillation of trajectories in the phase space. Nevertheless, recent studies on epilepsy often used the statistical characteristics of this space to diagnose epileptic seizures. Objectives: We evaluated changes caused by the seizures on the mentioned basin by focusing on phase space sorted by Poincaré sections. Ma...
متن کاملClassifying pentavalnet symmetric graphs of order $24p$
A graph is said to be symmetric if its automorphism group is transitive on its arcs. A complete classification is given of pentavalent symmetric graphs of order 24p for each prime p. It is shown that a connected pentavalent symmetric graph of order 24p exists if and only if p=2, 3, 5, 11 or 17, and up to isomorphism, there are only eleven such graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Zeitschrift für Ägyptische Sprache und Altertumskunde
سال: 2019
ISSN: 2196-713X,0044-216X
DOI: 10.1515/zaes-2018-1000